Linear Constraint Projection
نویسنده
چکیده
In most of the existing linear CLP systems, a projection is employed for the answer presentation in order to eliminate the dead variables not occuring in the query. But projection is more than an ornament of the answer presentation. We have shown that there are planning problems that depend heavily on an early projection. While it is not clear how to integrate early projection in the presence of backtrack-ing, the concept of constraint query languages, or bottom-up evaluation, even demands projection of the constraint set of every materialized fact on the fact's variables. We investigate possible environments for an eecient top-down, resp. bottom-up, evaluation of projection-intensive problems.
منابع مشابه
On Sequential Optimality Conditions without Constraint Qualifications for Nonlinear Programming with Nonsmooth Convex Objective Functions
Sequential optimality conditions provide adequate theoretical tools to justify stopping criteria for nonlinear programming solvers. Here, nonsmooth approximate gradient projection and complementary approximate Karush-Kuhn-Tucker conditions are presented. These sequential optimality conditions are satisfied by local minimizers of optimization problems independently of the fulfillment of constrai...
متن کاملFully Constrained Oblique Projection Approach to Mixed Pixel Linear Unmixing
Mixed pixels, which are inevitable in remote sensing images, often result in a lot of limitations in their applications. A novel approach for mixed pixel’s fully constrained unmixing, Fully Constrained Oblique Subspace Projection (FCOBSP) Linear Unmixing algorithm, is proposed to handle this problem. The Oblique Subspace Projection, in which the signal space is oblique to the background space, ...
متن کاملNew Iterative Methods for Linear Inequalities
New iterative methods for solving systems of linear inequalities are presented. Each step in these methods consists of finding the orthogonat projection of the current point onto a hyperplane corresponding to a surrogate constraint which is constructed through a positive combination of a group of violated constraints. Both sequential and parallel-implementations are discussed.
متن کاملData-Reusing Adaptive Filtering Algorithms with Adaptive Error Constraint
We present a family of data-reusing and affine projection algorithms. For identification of a noisy linear finite impulse response channel, a partial knowledge of a channel, especially noise, can be used to improve the performance of the adaptive filter. Motivated by this fact, the proposed scheme incorporates an estimate of a knowledge of noise. A constraint, called the adaptive noise constrai...
متن کاملProjection Inequalities and Their Linear Preservers
This paper introduces an inequality on vectors in $mathbb{R}^n$ which compares vectors in $mathbb{R}^n$ based on the $p$-norm of their projections on $mathbb{R}^k$ ($kleq n$). For $p>0$, we say $x$ is $d$-projectionally less than or equal to $y$ with respect to $p$-norm if $sum_{i=1}^kvert x_ivert^p$ is less than or equal to $ sum_{i=1}^kvert y_ivert^p$, for every $dleq kleq n$. For...
متن کامل